Method and controller for data rate adaptation in wireless communication networks

ABSTRACT

A wireless communication network with improved performance and a method and controller for controlling data rate in the network are provided. The invention provides a feedforward approach to data rate control in wireless networks. The invention is based on designing an optimal, but non-causal, controller and its subsequent “causification,” which results in a practical, implementable controller, driven by an estimate of the bit error probability. This controller leads to a minimum 5%-85% increase in average throughput without additional power utilization, as compared with fixed data rate operation.

CROSS-REFERENCE TO RELATED APPLICATION

[0001] This application claims the benefit of U.S. provisional application Serial No. 60/300,410, filed Jun. 22, 2001.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] This invention relates to wireless communication networks and methods and controllers for controlling data rate therein.

[0004] 2. Background Art

[0005] Feedback control of transmit power in wireless networks is a well established technology from both theoretical and practical perspectives. In contrast, control of data rate has been discussed in the following articles, where its efficacy has been demonstrated by simulations: M. B. Pursley and H. B. Russell, “Network Protocols for Frequency-Hop Packet Radios With Decoder Side Information,” IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol. 12, No. 4, pp. 612-621, 1194; M. B. Pursley and C. S. Wilkins, “Adaptive Transmission for Frequency-Hop Communications with Reed-Solomon Coding,” in PROC. PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, (Victoria, Canada), pp. 866-869, 1997; and J. H. Gass, M. B. Pursley, H. B. Russell, R. J. Saulitis, C. S. Wilkins, and J. S. Wysocarski, “Adaptive Transmission Protocols for Frequency-Hop Radio Networks,” in PROC. IEEE MILITARY COMMUNICATIONS CONFERENCE, pp. 282-286, 1998.

[0006] A wireless communication network can be viewed as a serial connection of three functional, rather than physical, blocks that represent relations between the system's variables as shown in FIG. 1.

[0007] In FIG. 1, E(k) is the energy with which the kth packet is transmitted. Since packet duration is fixed, energy and power can be used interchangeably. Block 1 represents the functional relation between E(k) and the received signal-to-noise ratio (SNR), r(k). This includes the effect of shadowing, h(k), path loss, ρ(k), and channel noise with multi-user interference, N(k). In particular, this relation takes the form $\begin{matrix} {{{r(k)} = {{F_{1}\left( {{E(k)},{h(k)},{\rho (k)},{N(k)}} \right)} = \frac{{h(k)}{\rho (k)}{E(k)}}{m\quad n\quad {N(k)}}}},} & (1.1) \end{matrix}$

[0008] where n is the number of coded symbols per packet and m is the number of bits representing each coded symbol.

[0009] Block 2 represents the relation between r(k) and the bit error probability, p_(be)(k). The perturbation γ(k) that acts on Block 2 is the channel uncertainty. γ(k) represents the parameter that characterizes a Rician fading channel with binary frequency shift keying (BFSK) modulation and noncoherent demodulation: $\begin{matrix} {{p_{be}(k)} = {{F_{2}\left( {{r(k)},{\gamma (k)}} \right)} = {\frac{1 + {\gamma^{2}(k)}}{2 + {{\gamma^{2}(k)}\left( {2 + {r(k)}} \right)}}{{\exp \left( {- \frac{r(k)}{2 + {{\gamma^{2}(k)}\left( {2 + {r(k)}} \right)}}} \right)}.}}}} & (1.2) \end{matrix}$

[0010] When γ(k)=0, the channel is an additive white Gaussian noise (AWGN) channel; when γ(k)=∞, it is a Rayleigh fading channel.

[0011] In the decomposition of the physical wireless channel into Blocks 1 and 2, the first block models the total average received energy and the second the split of this energy between the direct path and multipath. A rigorous justification of this decomposition can be obtained following the arguments given in the prior art.

[0012] Block 3 represents the relation between p_(be)(k) and the probability that the kth packet is successfully transmitted, p_(st)(k), assuming that q(k) data symbols were included in the packet of length n, i.e., n−q(k) symbols were devoted to coding. In this application, it is assumed that a Reed-Solomon (RS) code is used, in which case this relation is given by: $\begin{matrix} {{p_{st}(k)} = {{F_{3}\left( {{q(k)},{p_{be}(k)}} \right)} = {\sum\limits_{j = 0}^{\lfloor\frac{n - {q{(k)}}}{2}\rfloor}{\begin{pmatrix} n \\ j \end{pmatrix}\left( {1 - \left( {1 - {p_{be}(k)}} \right)^{m}} \right)^{j}{\left( {1 - {p_{be}(k)}} \right)^{m - {({n - j})}}.}}}}} & (1.3) \end{matrix}$

[0013] As the performance measure of this network, its average throughput is defined as: $\begin{matrix} {{T_{av} = {\lim\limits_{K->\infty}{\frac{1}{K}{\sum\limits_{k = 1}^{K}{E\left\lbrack {T(k)} \right\rbrack}}}}},} & (1.4) \end{matrix}$

[0014] where T(k) is the instantaneous throughput defined as

T(k)=q(k)p _(st)(k),   (1.5)

[0015] and E[·] denotes the expectation.

[0016] When the system operates with a fixed transmit power E(k)≡E_(d) and fixed data rate q(k)≡q_(d), it is referred to as an open-loop network.

[0017] As mentioned above, modern wireless networks use feedback power control to combat disturbances and improve T_(av). A functional block diagram of a represents the desired level of SNR, and the deviation of r(k) from r_(d) is the argument of the control law F₄. In practice, this law may be selected as:

E _(dB)(k+1)=E _(dB)(k)+Δsign(r _(d) −r(k)),

[0018] where E_(dB)(k)=10 log₁₀E(k), Δ>0 is a step in power increase/decrease, and ${{sign}(x)} = \left\{ \begin{matrix} {1,} & {{{{if}\quad x} > 0},} \\ {0,} & {{{{if}\quad x} = 0},} \\ {{- 1},} & {{{if}\quad x} < 0.} \end{matrix} \right.$

[0019] If this controller operates efficiently, r(k) at the output of Block 1 is close to r_(d) and T_(av), defined by (1.4), is improved compared to open-loop performance. However, even if the disturbances h(k), ρ(k), and N(k) are compensated for completely, i.e., r(k)≡r_(d), the channel uncertainty, γ(k), being outside of the control loop, would not be rejected, which would adversely affect T_(av). Therefore, further control measures, intended to accommodate γ(k) and, in addition, help feedback power control in combating h(k), ρ(k), and N(k) are desirable.

[0020] Another input variable that may be controlled is the data rate, q(k). However, feedback control of q(k) does not seem to be feasible. Indeed, whereas in power control one can defined the desired SNR (i.e., r_(d)), in rate control no desired set point for q(k) can be defined since it would depend on the unknown factors, for instance, h(k) and γ(k). Therefore, feedback control of q(k) is not feasible.

[0021] It should be pointed out that in asynchronous transfer mode (ATM) networks, feedback control of data rate is not only possible but is quite efficient. The reason is that in the ATM environment the occupancy of buffers at the switching nodes is affected by the admission data rate and therefore, regulating buffer occupancy to the desired level, effectively regulates data rate in a feedback manner.

[0022] Another possibility to consider would be feedforward control. To accomplish this, one would need to use the probability of bit error, p_(be)(k), and calculate q(k) so that the instantaneous throughput T(k), defined by (1.5), is maximized. A block diagram of the network with both feedback power control and feedforward rate control is shown in FIG. 3.

[0023] There are, however, impediments to this approach. First, p_(be)(k) is not known in real-time, and what might be available is the number of bit errors, n_(be)(k), when the packet is successfully decoded by a block code. Second, even if p_(be)(k) were known, it would be available only after the transmission took place, i.e., p_(be)(k) would have to be used to calculate not q(k) but q(k+1). Consequently, there is a need for a practical feedforward controller that overcomes these impediments.

SUMMARY OF THE INVENTION

[0024] An object of the present invention is to provide a method and controller for data rate adaptation in wireless communication networks in order to improve their performance (i.e., their throughput and power efficiency).

[0025] In carrying out the above object and other objects of the present invention, a wireless communication network is provided. The network includes a transmitter for wirelessly transmitting symbols represented by bits, and a receiver for receiving the symbols. The network further includes a controller for generating a data rate control signal which controls data rate based on an estimate of bit error probability to improve performance of the network.

[0026] The estimate of bit error probability may be based on number of bit errors that have occurred during a transmission in the network.

[0027] The network may further include a feedback power controller for controlling transmit power in the network.

[0028] Further in carrying out the above object and other objects of the present invention, a method for controlling data rate of a wireless communications network is provided wherein the receiver receives symbols represented by bits. The method includes generating an estimate of bit error probability and generating a control signal which controls data rate based on the estimate of bit error probability to improve performance of the network.

[0029] Still further in carrying out the above object and other objects of the present invention, a controller for controlling data rate of a wireless communication network is provided wherein the receiver receives symbols represented by bits. The controller includes means for generating an estimate of bit error probability, and means for generating a control signal which controls data rate based on the estimate of bit error probability to improve performance of the network.

[0030] The controller may further include a memory for storing the number of bit errors that have occurred during the transmission.

[0031] The above object and other objects, features, and advantages of the present invention are readily apparent from the following detailed description of the best mode for carrying out the invention when taken in connection with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0032]FIG. 1 is a functional block diagram of a prior art open-loop network;

[0033]FIG. 2 is a diagram similar to the diagram of FIG. 1, but including feedback power control;

[0034]FIG. 3 is a diagram similar to the diagram of FIG. 2, but including feedforward rate control; and

[0035]FIG. 4 is a graph which illustrates an optimal control q(k)=F₅(p_(be)(k)) for n=32 and m=5.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0036] The problems addressed and solved by the present invention are as follows:

[0037] 1. The least upper bound of the achievable efficacy of feedforward data rate control in improving T_(av). This is accomplished by designing an optimal but non-causal and non-realistic controller, whereby q(k) is calculated as a function of p_(be)(k). This controller leads to a minimum of 35%-95% increase in average throughput without additional power utilization, as compared with fixed data rate operation.

[0038] 2. Based on the above optimal controller, a sequence of suboptimal controllers that make it causal and realistic is provided. The final suboptimal controller calculates q(k) as a function of n_(be)(k−1), n_(be)(k−2), . . . ,n_(be)(k−L), where L is a positive integer representing the memory of the controller.

[0039] 3. The performance degradation of suboptimal controllers due to both causification and making them realistic is described. In the scenario considered herein, the final suboptimal controller results in 5%-25% degradation compared to the optimal controller, and a minimum of 5%-85% improvement compared to fixed data rate operation. Thus, an implementable, i.e., causal and realistic, controller is obtained that improves T_(av) substantially without additional power expenditure.

[0040] Modeling

[0041] The wireless network described herein includes a transmitter (mobile user), a channel, and a receiver (base station).

[0042] Transmitter

[0043] The transmitter sends information to the receiver in packets of fixed duration. The kth packet, k=1,2, . . . , consists of q(k) data symbols and is sent with transmit power E(k), where q(k) ε{1,2, . . . ,n} and each symbol belongs to the Galois field with 2^(m) elements, m>1. For the kth packet, the (n, q(k)) RS code is used to map the q(k) data symbols into n coded symbols if q(k)<n. If q(k)=n, no coding is performed. Each coded symbol is in turn mapped into m bits, yielding a total of mn bits. BFSK modulation is then used to transmit the mn bits with power $\frac{E(k)}{m\quad n}$

[0044] per bit across the channel.

[0045] Channel

[0046] The channel attenuates the transmitted signal by shadowing, h(k), and path loss, ρ(k), and distorts it with AWGN and multi-user interference, N(k). It is assumed that these disturbances are such that the SNR is constant for each bit in the kth packet. Therefore, the SNR during the transmission of the kth packet can be represented as given in (1.1).

[0047] In addition to the above-mentioned disturbances, the channel also exhibits Rician fading with parameter γ(k), which represents the ratio of the strength of the multipath to the strength of the direct path. This parameter is also assumed to be constant during the transmission of the kth packet.

[0048] The assumption that h(k), ρ(k), N(k), r(k), and γ(k) are constant during the transmission of the kth packet is introduced to simplify the analysis. Although it is somewhat artificial, it is not unrealistic because the packet duration is usually short relative to the rate of change of these perturbations; therefore all bits in a packet are transmitted roughly under the same conditions.

[0049] Receiver

[0050] For the kth packet, the receiver performs noncoherent demodulation on the received signal to obtain mn bits, where bit errors are assumed to occur independently. The mn bits are in turn mapped into n coded symbols. The (n,q(k)) RS decoder is then used to map the n received symbols into q(k) data symbols if q(k)<n, which may not be successful. If q(k)=n, no decoding is performed. the kth packet is said to be successfully transmitted/received if the q(k) data symbols are correctly decoded.

[0051] The conditional probability that the number of bit errors in the kth packet, n_(be)(k), equal to l is: $\left. {{{Prob}\left( {{n_{be}(k)} = l} \right.}{p_{be}(k)}} \right) = {\begin{pmatrix} {m\quad n} \\ l \end{pmatrix}{p_{be}^{l}(k)}{\left( {1 - {p_{be}(k)}} \right)^{{m\quad n} - l}.}}$

[0052] The condition p_(be)(k) is a random event since γ(k) is assumed to be random. Since a coded symbol is correctly received if and only if all the m bits representing it are correctly received, the probability of coded symbol error for each symbol in the kth packet, p_(ce)(k), is related to p_(be)(k) by:

p _(ce)(k)=1−(1−p _(be)(k))^(m).   (2.1)

[0053] Furthermore, since the (n,q(k)) RS code can correct up to $\left\lfloor \frac{n - {q(k)}}{2} \right\rfloor$

[0054] errors, the probability that the kth packet is successfully transmitted, p_(st)(k), is given by: ${{p_{st}(k)} = {\sum\limits_{j = 0}^{\lfloor\frac{n - {q{(k)}}}{2}\rfloor}{\begin{pmatrix} n \\ j \end{pmatrix}{p_{ce}^{j}(k)}\left( {1 - {p_{ce}(k)}} \right)^{n - j}}}},$

[0055] which coincides with (1.3) when (2.1) is substituted for p_(ce)(k).

[0056] Information Available for Control

[0057] As it follows from the above, if the kth packet is received successfully, the receiver has the knowledge of the number of bit errors, n_(be)(k), that have occurred during the transmission. If the kth packet is not received successfully, n_(be)(k) is not available. To overcome this problem, it is assumed that in this case, the number of coded symbol errors, n_(ce)(k), is equal to the maximum error correcting capability plus one, i.e., ${N_{CE}(k)} = {\left\lfloor \frac{n - {q(k)}}{2} \right\rfloor + 1.}$

[0058] The corresponding n_(be)(k) can be then estimated using this assumption and expression (2.1), by substituting frequencies instead of the probabilities, i.e., $\frac{\left\lfloor {\frac{n - {q(k)}}{2} + 1} \right\rfloor}{n} \approx {1 - {\left( {1 - \frac{n_{be}(k)}{mn}} \right)^{m}\quad {or}}}$ ${n_{be}(k)} \approx {{{mn}\left( {1 - \left( {1 - \frac{\left\lfloor {\frac{n - {q(k)}}{2} + 1} \right\rfloor}{n}} \right)^{\frac{1}{m}}} \right)}.}$

[0059] Thus, the information available for control is: $\begin{matrix} {{n_{be}^{\prime}(k)} = \left\{ \begin{matrix} {{n_{be}(k)},} & {{{if}\quad {the}\quad {kth}\quad {packet}\quad {is}\quad {received}\quad {successfully}},} \\ {{{mn}\left( {1 - \left( {1 - \frac{\left\lfloor \frac{n - {q(k)}}{2} \right\rfloor + 1}{n}} \right)^{\frac{1}{m}}} \right)},} & {{otherwise}.} \end{matrix} \right.} & (2.2) \end{matrix}$

[0060] Although in reality only n′_(be)(k) is available, to simplify the analysis, it is assumed below that n_(be)(k) is known, whether or not the kth packet has been received successfully. However, at the final stage of the development (see below) the system is similar and operating with n′_(be)(k) , rather than n_(be)(k), and it is shown that its performance remains practically unchanged.

[0061] Data Rate Controllers

[0062] A sequence of data rate controllers is now described, which differ from the point of view of the information used for control, i.e., for calculating q(k). An optimal but non-implementable controller is initially described and gradually improves its implementability until a practical, implementable controller is obtained.

[0063] Optimal (O) Controller

[0064] It is assumed that p_(be)(k) is available for calculating q(k). this information structure is non-causal since p_(be)(k) is assumed to be available before the kth packet is transmitted It is non-realistic because only frequency $\frac{n_{be}(k)}{mn},$

[0065] rather than probability p_(be)(k), may be available for control. As it was pointed out above, this control is designed to investigate the least upper bound on the efficacy of data rate control.

[0066] To derive the controller that maximizes $\begin{matrix} \begin{matrix} {T_{av} = \quad {\lim\limits_{K->\infty}{\frac{1}{K}{\sum\limits_{k = 1}^{K}{E\left\lbrack {{q(k)}{p_{st}(k)}} \right\rbrack}}}}} \\ {{= \quad {\lim\limits_{K->\infty}{\frac{1}{K}{\sum\limits_{k = 1}^{K}{E\left\lbrack {{q(k)}{F_{3}\left( {{a(k)},{p_{be}(k)}} \right)}} \right\rbrack}}}}},} \end{matrix} & (3.1) \end{matrix}$

[0067] It is observed that the process at hand is memoryless and, therefore, maximization of T_(av) is equivalent to the maximization of the expected value of the instantaneous throughput (1.5), i.e., of each term in the sum given by (3.1). Thus, the optimal controller is given by: $\begin{matrix} {{{q(k)} = {{F_{5}\left( {p_{be}(k)} \right)} = {\underset{q_{0}ɛ{\{{1,2,\ldots \quad,n}\}}}{{\arg \quad \max}\quad}q_{0}{F_{3}\left( {q_{0},{p_{be}(k)}} \right)}}}},{k = 1},2,\ldots} & (3.2) \end{matrix}$

[0068] For the case of n=32 and m=5, this controller is illustrated in FIG. 4. Obviously, it is a static, nonlinear controller. It is also obvious that this is a feedforward controller, since p_(be)(k) provides the information about the disturbances (γ(k) and others), acting on the system, and the controller determines the control signal q(k), which counteracts the effect of these disturbances in order to maximize T_(av).

[0069] Performance of all other controllers introduced herein are compared to that of (3.2).

[0070] Causal, Non-Realistic (CNR) Controller

[0071] Here, it is assumed that p_(be)(k−1) is available for calculating q(k) and the controller is defined as:

q(k)=F ₅(p_(be)(k−1)), k=2,3, . . . ,   (3.3)

[0072] with initial condition q(1) ε{1,2, . . . ,n}, where F₅(·) is defined by (3.2). Obviously, this controller is causal since q(k) depends on p_(be)(k−1).

[0073] Non-Causal, Realistic (NCR) Controller

[0074] Here, it is assumed that n_(be)(k) is available for control and the controller is defined as: $\begin{matrix} {{{q(k)} = {F_{5}\left( \frac{n_{be}(k)}{mn} \right)}},{k = 1},2,\ldots \quad,} & (3.4) \end{matrix}$

[0075] where F₅(·) is given by (3.2).

[0076] Causal, Realistic (CR) Controller

[0077] It is assumed, finally, that only n_(be)(k−1) is available for calculating q(k). This suggests the controller $\begin{matrix} {{{q(k)} = {F_{5}\left( \frac{n_{be}\left( {k - 1} \right)}{mn} \right)}},{k = 2},3,\ldots \quad,} & (3.5) \end{matrix}$

[0078] with initial condition q(1) ε{1,2, . . . ,n}.

[0079] It turns out that, unlike all previous ones, this controller might lead to a substantial loss of performance in comparison with the optimal one. Therefore, a filtered version of this controller is introduced below.

[0080] Causal, Realistic Controller with Filtering (CRF)

[0081] Typically, bit error probability p_(be)(k) lies in the range of 10⁻¹ to 10⁻⁷. Thus, in order for $\frac{n_{be}(k)}{mn}$

[0082] to be an accurate estimate of p_(be)(k), the number of bits in a packet mn should be sufficiently large. In most practical situations, mn cannot be chosen to be very large. To improve the quality of the estimate, which would in turn reduce the performance loss, a filter with finite memory L is inserted into (3.5) in the following manner: $\begin{matrix} {{{n_{be}\left( {k - 1} \right)} = {\left( {1 - \alpha} \right){\sum\limits_{j = 1}^{\min {\{{{k - 1},L}\}}}{\alpha^{j - 1}{n_{be}\left( {k - j} \right)}}}}},{k = 2},3,\ldots \quad,} & \text{(3.6a)} \\ {{{q(k)} = {F_{5}\left( \frac{n_{be}\left( {k - 1} \right)}{mn} \right)}},{k = 2},3,\ldots \quad,} & \text{(3.6b)} \end{matrix}$

[0083] with initial condition q(1) ε{1,2, . . . ,n}, where α ε[0,1) and L, a positive integer, are design parameters. (3.6) reduces to (3.5) when α=0.

[0084] Implementable (I) Controller

[0085] Although controllers (3.5) and (3.6) are causal and realistic, they are still not implementable since they are based on n_(be)(k), which in reality is available only when the kth packet is received successfully. To obtain an implementable controller, n_(be)(k) is replaced in (3.6a) with n′_(be)(k) defined in (2.2). Thus, an implementable controller with filtering can be represented as follows: $\begin{matrix} {{{n_{be}^{\prime}\left( {k - 1} \right)} = {\left( {1 - \alpha} \right){\sum\limits_{j = 1}^{\min {\{{{k - 1},L}\}}}{\alpha^{j - 1}{n_{be}^{\prime}\left( {k - j} \right)}}}}},{k = 2},3,\ldots \quad,} & \text{(3.7a)} \\ {{{q(k)} = {F_{5}\left( \frac{\left. {{n_{be}^{\prime}k} - 1} \right)}{mn} \right)}},{k = 2},3,\ldots \quad,} & \text{(3.7b)} \end{matrix}$

[0086] with initial condition q(1) ε{1,2, . . . ,n}, where again, α ε[0,1) and L, a positive integer, are design parameters.

[0087] A feedforward data rate controller for wireless networks is described above which may be used synergistically with existing feedback power control schemes. Alternatively, it may lead to a possibility of novel architectures, where power control is used only to solve the near-far problem, and the rejection of all channel disturbances is accomplished by data rate control. This would reduce the possibility of power wars, which may be advantageous in a number of applications, in particular, in ad hoc networks. The drawback of this architecture would be the variable data rate of transmission which, in principle, may be counteracted by a variable compression rate.

[0088] While the best mode for carrying out the invention has been described in detail, those familiar with the art to which this invention relates will recognize various alternative designs and embodiments for practicing the invention as defined by the following claims. 

What is claimed is:
 1. A wireless communication network comprising: a transmitter for wirelessly transmitting symbols represented by bits; a receiver for receiving the symbols; and a controller for generating a data rate control signal which controls data rate based on an estimate of bit error probability to improve performance of the network.
 2. The network as claimed in claim 1 wherein the estimate of bit error probability is based on number of bit errors that have occurred during a transmission in the network.
 3. The network as claimed in claim 1 further comprising a feedback power controller for controlling transmit power in the network.
 4. A method for controlling data rate of a wireless communications network wherein the receiver receives symbols represented by bits, the method comprising: generating an estimate of bit error probability; and generating a control signal which controls data rate based on the estimate of bit error probability to improve performance of the network.
 5. The method as claimed in claim 4 wherein the estimate of bit error probability is based on number of error bits that have occurred during a transmission in the network.
 6. A controller for controlling data rate of a wireless communication network wherein the receiver receives symbols represented by bits, the controller comprising: means for generating an estimate of bit error probability; and means for generating a control signal which controls data rate based on the estimate of bit error probability to improve performance of the network.
 7. The controller as claimed in claim 6 wherein the estimate of bit error probability is based on number of bit errors that have occurred during a transmission in the network.
 8. The controller as claimed in claim 7 further comprising a memory for storing the number of bit errors that have occurred during the transmission. 